0.00/0.00	% File    : /export/starexec/sandbox/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : app
0.00/0.00	% Variant    : fo
0.00/0.00	% Ordering    : kbo
0.00/0.00	% Command    : 
0.00/0.00	#!/bin/sh
0.00/0.00	
0.00/0.00	./zipperposition.native ${1:+"$1"} \
0.00/0.00	  -i tptp \
0.00/0.00	  -o tptp \
0.00/0.00	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.00	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.00	  --no-ho \
0.00/0.00	  --no-avatar \
0.00/0.00	  --no-induction \
0.00/0.00	  --no-unif-pattern \
0.00/0.00	  --ord $2 \
0.00/0.00	  --simultaneous-sup false \
0.00/0.00	  --no-max-vars \
0.00/0.00	  --no-fool
0.00/0.19	% Computer   : n059.star.cs.uiowa.edu
0.00/0.19	% Model      : x86_64 x86_64
0.00/0.19	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.19	% Memory     : 32218.625MB
0.00/0.19	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.19	% CPULimit   : 300
0.00/0.19	% DateTime   : Fri Feb  2 17:19:53 CST 2018
0.00/0.20	% done 2 iterations in 0.003s
0.00/0.20	% SZS status Theorem for 'stdin'
0.00/0.20	% SZS output start Refutation
0.00/0.20	tff(zf_stmt_3, conjecture,
0.00/0.20	  (![S:app_encode_fun(a,$o),T:app_encode_fun(a,$o),Xx:a]:
0.00/0.20	     ((app_encode_app(a,$o,S,Xx) & app_encode_app(a,$o,T,Xx)) =>
0.00/0.20	      app_encode_app(a,$o,T,Xx)))).
0.00/0.20	tff(zf_stmt_0, negated_conjecture,
0.00/0.20	  (~
0.00/0.20	    (![S:app_encode_fun(a,$o),T:app_encode_fun(a,$o),Xx:a]:
0.00/0.20	       ((app_encode_app(a,$o,S,Xx) & app_encode_app(a,$o,T,Xx)) =>
0.00/0.20	        app_encode_app(a,$o,T,Xx))))).
0.00/0.20	tff('0', plain, ~ app_encode_app(a, $o, sk_T, sk_Xx),
0.00/0.20	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.20	tff('1', plain, app_encode_app(a, $o, sk_T, sk_Xx),
0.00/0.20	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.20	tff('2', plain, ~ $true, inference('demod', [status(thm)], ['0', '1'])).
0.00/0.20	tff('3', plain, $false, inference('simplify', [status(thm)], ['2'])).
0.00/0.20	
0.00/0.20	% SZS output end Refutation
0.00/0.20	EOF
